Issues about the Developmet of a Disjunctive Program Solver
نویسندگان
چکیده
The development of a disjunctive program solver is described in this paper. First, the implementation of a language compiler needed to formulate discrete decisions thorough disjunctions is presented. The proposed language is implemented as a superset of the commercial mathematical program system solver GAMS. The interactions between both systems are also detailed. Finally, the steps executed to solve problems formulated with disjunctions with the new system are presented.
منابع مشابه
Overview of the Monadic Constraint Programming Framework
A constraint programming system combines two essential components: a constraint solver and a search engine. The constraint solver reasons about satisfiability of conjunctions of constraints, and the search engine controls the search for solutions by iteratively exploring a disjunctive search tree defined by the constraint program. The Monadic Constraint Programming framework gives a monadic def...
متن کاملMonadic constraint programming
A constraint programming system combines two essential components: a constraint solver and a search engine. The constraint solver reasons about satisfiability of conjunctions of constraints, and the search engine controls the search for solutions by iteratively exploring a disjunctive search tree defined by the constraint program. In this paper we give a monadic definition of constraint program...
متن کاملSecurity-constrained transmission planning:A mixed-integer disjunctive approach
We extend a static mixed integer disjunctive (MID) transmission expansion planning model so as to deal with circuit contingency criterion. The model simultaneously represents the network constraints for base case and each selected circuit contingency. The MID approach allows a commercial optimization solver to achieve and prove solution optimality. The proposed approach is applied to a regional...
متن کاملAdvanced Conflict-Driven Disjunctive Answer Set Solving
We introduce a new approach to disjunctive ASP solving that aims at an equitable interplay between “generating” and “testing” solver units. To this end, we develop novel characterizations of answer sets and unfounded sets allowing for a bidirectional dynamic information exchange between solver units for orthogonal tasks. This results in the new multithreaded disjunctive ASP solver claspD-2, gre...
متن کاملDesign, Implementation, and Evaluation of the Constraint Language cc(FD)
. This paper describes the design, implementation, and applications of the constraint logic language cc(FD). cc(FD) is a declarative nondeterministic constraint logic language over nite domains based on the cc framework [33], an extension of the CLP scheme [21]. Its constraint solver includes (non-linear) arithmetic constraints over natural numbers which are approximated using domain and interv...
متن کامل